全文获取类型
收费全文 | 2446篇 |
免费 | 102篇 |
国内免费 | 245篇 |
专业分类
化学 | 164篇 |
晶体学 | 4篇 |
力学 | 118篇 |
综合类 | 40篇 |
数学 | 2147篇 |
物理学 | 320篇 |
出版年
2023年 | 27篇 |
2022年 | 22篇 |
2021年 | 20篇 |
2020年 | 36篇 |
2019年 | 55篇 |
2018年 | 30篇 |
2017年 | 61篇 |
2016年 | 56篇 |
2015年 | 34篇 |
2014年 | 78篇 |
2013年 | 179篇 |
2012年 | 89篇 |
2011年 | 108篇 |
2010年 | 103篇 |
2009年 | 114篇 |
2008年 | 123篇 |
2007年 | 158篇 |
2006年 | 123篇 |
2005年 | 124篇 |
2004年 | 94篇 |
2003年 | 109篇 |
2002年 | 103篇 |
2001年 | 79篇 |
2000年 | 109篇 |
1999年 | 83篇 |
1998年 | 110篇 |
1997年 | 75篇 |
1996年 | 55篇 |
1995年 | 39篇 |
1994年 | 40篇 |
1993年 | 33篇 |
1992年 | 25篇 |
1991年 | 37篇 |
1990年 | 16篇 |
1989年 | 12篇 |
1988年 | 21篇 |
1987年 | 19篇 |
1986年 | 18篇 |
1985年 | 29篇 |
1984年 | 27篇 |
1983年 | 6篇 |
1982年 | 19篇 |
1981年 | 12篇 |
1980年 | 15篇 |
1979年 | 21篇 |
1978年 | 15篇 |
1977年 | 11篇 |
1976年 | 12篇 |
1975年 | 3篇 |
1974年 | 5篇 |
排序方式: 共有2793条查询结果,搜索用时 15 毫秒
1.
2.
Well-Posedness by Perturbations of Variational Problems 总被引:3,自引:0,他引:3
Lemaire B. Ould Ahmed Salem C. Revalski J. P. 《Journal of Optimization Theory and Applications》2002,115(2):345-368
In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented. 相似文献
3.
Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak
estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum,
minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity
networks is considered.
Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002 相似文献
4.
Filippo Bracci Roberto Tauraso Fabio Vlacci 《Journal of Mathematical Analysis and Applications》2002,270(2):1131-473
Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g. 相似文献
5.
Efficient measurement of the performance index (the distance of a loading parameter from the voltage collapse point) is one of the key problems in power system operations and planning and such an index indicates the severity of a power system with regard to voltage collapse. There exist many interesting methods and ideas to compute this index. However, some successful methods are not yet mathematically justified while other mathematically sound methods are often proposed directly based on the bifurcation theory and they require the initial stationary state to be too close to the unknown turning point to make the underlying methods practical.This paper first gives a survey of several popular methods for estimating the fold bifurcation point including the continuation methods, bifurcation methods and the test function methods (Seydel's direct solution methods, the tangent vector methods and the reduced Jacobian method) and discuss their relative advantages and problems. Test functions are usually based on scaling of the determinant of the Jacobian matrix and it is generally not clear how to determine the behaviour of such functions. As the underlying nonlinear equations are of a particular type, this allows us to do a new analysis of the determinants of the Jacobian and its submatrices in this paper. Following the analysis, we demonstrate how to construct a class of test functions with a predictable analytical behaviour so that a suitable index can be produced. Finally, examples of two test functions from this class are proposed. For several standard IEEE test systems, promising numerical results have been achieved. 相似文献
6.
7.
8.
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes 总被引:1,自引:0,他引:1
It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n). 相似文献
9.
广义多目标minmax问题的最优性条件和极大熵方法 总被引:1,自引:0,他引:1
本文讨论了广义多目标minmax问题的最优性条件。利用极大熵逼近函数,研究了广义多目标minmax;问题的逼近问题,在较弱的条件下,证明了由极大熵逼近函数导出的多目标逼近问题的临界点的任一极限点均为原广义多目标minmax问题的临界点。 相似文献
10.
Artūras Dubickas 《Proceedings Mathematical Sciences》2005,115(4):391-397
Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα
n
, n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational
non-integer number, this result was proved by Vijayaraghavan. 相似文献